منابع مشابه
On minimal realization of IF-languages: A categorical approach
he purpose of this work is to introduce and study the concept of minimal deterministic automaton with IF-outputs which realizes the given IF-language. Among two methods for construction of such automaton presented here, one is based on Myhill-Nerode's theory while the other is based on derivatives of the given IF-language. Meanwhile, the categories of deterministic automata with IF-outputs and ...
متن کاملMinimal Partial Languages and Automata
Partial words are sequences of characters from an alphabet in which some positions may be marked with a “hole” symbol, . We can create a -substitution mapping this symbol to a subset of the alphabet, so that applying such a substitution to a partial word results in a set of full words (ones without holes). This setup allows us to compress regular languages into smaller partial languages. Determ...
متن کاملMinimal Covers of Formal Languages
Let L1; L2 be languages. If L1 L2, then we say that L2 covers L1. Let C;D be classes of languages over . We call a cover L2 2 C of L1 a C-minimal cover with respect to D if, for all L0 2 C, L1 L0 L2 implies L2 L0 2 D. We examine in detail the particular cases of minimal regular covers and minimal context-free covers, both with respect to nite languages. The closure properties of the class of la...
متن کاملMinimal NFA and biRFSA Languages
In this paper, we define the notion of biRFSA which is a residual finate state automaton (RFSA) whose the reverse is also an RFSA. The languages recognized by such automata are called biRFSA languages. We prove that the canonical RFSA of a biRFSA language is a minimal NFA for this language and that each minimal NFA for this language is a sub-automaton of the canonical RFSA. This leads to a char...
متن کاملMinimal Union-Free Decompositions of Regular Languages
A regular language is called union-free if it can be represented by a regular expression that does not contain the union operation. Every regular language can be decomposed into a union of a finite number of union-free languages (the so-called union-free decomposition). We call the number of components in the minimal union-free decomposition of a regular language the union width of the regular ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00105-x